Eigenvalue distribution in scale free graphs
نویسنده
چکیده
Scale free graphs can be found very often as models of real networks and are characterized by a power law degree distribution, that is, for a constant γ ≥ 1 the number of vertices of degree d is proportional to d−γ . Experimental studies show that the eigenvalue distribution also follows a power law for the highest eigenvalues. Hence it has been conjectured that the power law of the degrees determines the power law of the eigenvalues. In this paper we show that we can construct a scale free graph with non highest eigenvalue power law distribution. For γ = 1 we can construct a scale free graph with small spectrum and a regular graph with eigenvalue power law distribution. AMS classi cation: 05C07, 05C50, 05C90, 90B10, 90C06
منابع مشابه
Bipartite Subgraphs and the Signless Laplacian Matrix
For a connected graph G, we derive tight inequalities relating the smallest signless Laplacian eigenvalue to the largest normalised Laplacian eigenvalue. We investigate how vectors yielding small values of the Rayleigh quotient for the signless Laplacian matrix can be used to identify bipartite subgraphs. Our results are applied to some graphs with degree sequences approximately following a pow...
متن کاملEigenvalue spectra of complex networks
Abstract We examine the eigenvalue spectrum, ρ(μ), of the adjacency matrix of a random scale-free network with an average of p edges per vertex using the replica method. We show how in the dense limit, when p → ∞, one can obtain two relatively simple coupled equations whose solution yields ρ(μ) for an arbitrary complex network. For scale-free graphs, with degree distribution exponent λ, we obta...
متن کاملSpectral and dynamical properties in classes of sparse networks with mesoscopic inhomogeneities.
We study structure, eigenvalue spectra, and random-walk dynamics in a wide class of networks with subgraphs (modules) at mesoscopic scale. The networks are grown within the model with three parameters controlling the number of modules, their internal structure as scale-free and correlated subgraphs, and the topology of connecting network. Within the exhaustive spectral analysis for both the adj...
متن کاملOn the Synchronization of Networks with Prescribed Degree Distributions
We show that the degree distributions of graphs do not suffice to characterize the synchronization of systems evolving on them. We prove that, for any given degree sequence satisfying certain conditions, a connected graph having that degree sequence exists for which the first nontrivial eigenvalue of the graph Laplacian is arbitrarily close to zero. Consequently, dynamical systems defined on su...
متن کاملNetworks in life: Scaling properties and eigenvalue spectra
We analyse growing networks ranging from collaboration graphs of scientists to the network of similarities defined among the various transcriptional profiles of living cells. For the explicit demonstration of the scale-free nature and hierarchical organization of these graphs, a deterministic construction is also used. We demonstrate the use of determining the eigenvalue spectra of sparse rando...
متن کامل